Necklace polynomial

In combinatorial mathematics, the necklace polynomials, or (Moreau's) necklace-counting function are the polynomials M(α,n) in α such that

\alpha^n = \sum_{d\,|\,n} d \, M(\alpha, d).

By Möbius inversion they are given by

 M(\alpha,n) = {1\over n}\sum_{d\,|\,n}\mu\left({n \over d}\right)\alpha^d

where μ is the classic Möbius function.

The necklace polynomials are closely related to the functions studied by C. Moreau (1872), though they are not quite the same: Moreau counted the number of necklaces, while necklace polynomials count the number of aperiodic necklaces.

The necklace polynomials appear as:

Values

See also

References